Review on String-Matching Algorithm

String-matching algorithm is one of the most researched algorithms in computer science which has become an important factor many technologies. This field aims at utilizing least time and resources to find desired sequence character complex data content. The classical famous string-search are Knuth-Morris-Pratt (KMP) Boyer-Moore (DM) algorithm. These two provide efficient heuristic jump rules by prefix or suffix. Bitap was first introduce bit-parallelism into string-matching field. Backward Non-Deterministic DAWG Matching (BNDM) a modern practical that outstanding combination theoretical research application. Those meaningful play guiding role future improve average performance reduce resource consumption.